All finitely axiomatizable subframe logics containing the provability logic CSM $_{0}$ are decidable
نویسندگان
چکیده
منابع مشابه
All finitely axiomatizable subframe logics containing the provability logic CSM 0_{0} are decidable
In this paper we investigate those extensions of the bimodal provability logic CSM 0 (alias PRL 1 or F ?) which are subframe logics, i.e. whose general frames are closed under a certain type of substructures. Most bimodal provability logics are in this class. The main result states that all nitely axiomatizable subframe logics containing CSM 0 are decidable. We note that, as a rule, interesting...
متن کاملAll Nitely Axiomatizable Subframe Logics Containing the Provability Logic Csm 0 Are Decidable
In this paper we investigate those extensions of the bimodal provability logicCSM0 (alias PRL1 or F ) which are subframe logics, i.e. whose general frames are closed under a certain type of substructures. Most bimodal provability logics are in this class. The main result states that all nitely axiomatizable subframe logics containing CSM0 are decidable. We note that, as a rule, interesting syst...
متن کاملAll Normal Extensions of S5-squared Are Finitely Axiomatizable
We prove that every normal extension of the bi-modal system S5 is finitely axiomatizable and that every proper normal extension has NP-complete satisfiability problem.
متن کاملIteration Algebras are not Finitely Axiomatizable : Extended
Algebras whose underlying set is a complete partial order and whose termoperations are continuous may be equipped with a least fixed point operation μx.t. The set of all equations involving the μ-operation which hold in all continuous algebras determines the variety of iteration algebras. A simple argument is given here reducing the axiomatization of iteration algebras to that of Wilke algebras...
متن کاملDecidable Gödel Description Logics without the Finitely-Valued Model Property
In the last few years, there has been a large effort for analyzing the computational properties of reasoning in fuzzy description logics. This has led to a number of papers studying the complexity of these logics, depending on the chosen semantics. Surprisingly, despite being arguably the simplest form of fuzzy semantics, not much is known about the complexity of reasoning in fuzzy description ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 1998
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s001530050090